Integer Linear Programming Model for Multicast Routing to Minimize Link Cost at Wavelengths

Routing is a technique or process carried out in packet information delivery system from source to destination place that requests the needed source. done solving problem and well-known unicast routing. Unicast routing can transmit single destination. However, this ineffective for an infinite number of be served because only funnels one So another route handle this, called multicast route. Multicast serve multiple destinations with so collection get same request time data. This research will discuss minimize link costs at wavelengths using hierarchical structure. To help provide reduction savings on by offering integer linear programming model formulation wavelengths. An update previous studies use structure wavelength conversion taking into account links are traversed Using there no continuity problems, when sending you more path choices save passed intermediate node until it reaches node, find efficiently goal minimizing cost achieved